Inverse-Pagerank-particle swarm optimisation for inverse identification of hyperelastic models: a feasibility study
نویسندگان
چکیده
In this study, the Finite-Element Model Updating (FEMU) technique is used to identify hyperelastic parameters from only one heterogeneous test. A residual considering measured and identified stretches as well global reaction force of specimen built. The originality paper investigate feasibility resolution minimisation problem using Inverse-PageRank-particle swarm optimisation (PSO) for identifying parameters. For that purpose, so-called PSO has been enriched with a PageRank algorithm adapt iteratively As examines whether Inverse-PageRank-PSO adapted or not objective function in present case, two basic models have considered.
منابع مشابه
INVERSE FREQUENCY RESPONSE ANALYSIS FOR PIPELINES LEAK DETECTION USING THE PARTICLE SWARM OPTIMIZATION
Inverse Transient Analysis (ITA) is a powerful approach for leak detection of pipelines. When the pipe transient flow is analyzed in frequency domain the ITA is called Inverse Frequency Response Analysis (IFRA). To implement an IFRA for leak detection, a transient state is initiated in the pipe by fast closure of the downstream end valve. Then, the pressure time history at the valve location is...
متن کاملa study on thermodynamic models for simulation of 1,3 butadiene purification columns
attempts have been made to study the thermodynamic behavior of 1,3 butadiene purification columns with the aim of retrofitting those columns to more energy efficient separation schemes. 1,3 butadiene is purified in two columns in series through being separated from methyl acetylene and 1,2 butadiene in the first and second column respectively. comparisons have been made among different therm...
InvestorRank and an Inverse Problem for PageRank
We explore methods that allow us to change an existing network’s structure to achieve a desired PageRank. Being able to change the ranking of the nodes is desirable for any network for which the PageRank determines the importance of the nodes. We search for a perturbation to the original network that when added will give the desired ranking. We derive multiple algorithms to solving this Inverse...
متن کاملGeometric Particle Swarm Optimisation
Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimization (PSO) and evolutionary algorithms. This connection enables us to generalize PSO to virtually any solution representation in a natural and straightforward way. We demonstrate this for the cases of Euclidean, Manhattan and Hamming spaces.
متن کاملPerceptive Particle Swarm Optimisation
Conventional particle swarm optimisation relies on exchanging information through social interaction among individuals. However for real-world problems involving control of physical agents (i.e., robot control), such detailed social interaction is not always possible. In this study, we propose the Perceptive Particle Swarm Optimisation algorithm, in which both social interaction and environment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Rubber Research
سال: 2021
ISSN: ['2524-3993', '1511-1768']
DOI: https://doi.org/10.1007/s42464-021-00113-8